Visual Analogy: Viewing Retrieval and Mapping as Constraint Satisfaction Problems
نویسندگان
چکیده
We examine the retrieval and mapping tasks of visual analogy as constraint satisfaction problems. We describe a constraint satisfaction method for the two tasks; the method organizes the source cases in a discrimination tree; uses heuristics to guide the search; performs backtracking, and searches all the source cases at once. We present an evaluation of this method for retrieval and mapping of diagrammatic cases containing 2D line drawings.
منابع مشابه
Visual Analogy: Reexamining Analogy as a Constraint Satisfaction Problem
Holyoak and Thagard proposed that the retrieval and mapping tasks of analogy can be viewed as constraint satisfaction problems, and described a connectionist implementation of their proposal. In this paper, we describe another constraint satisfaction method for the two tasks in the context of visual analogy: in our method, the source cases are organized in a discrimination tree, and all the sou...
متن کاملVisual Analogy: Reexamining Analogy as a Constraint Satisfaction Problem1
Holyoak and Thagard proposed that the retrieval and mapping tasks of analogy can be viewed as constraint satisfaction problems, and described a connectionist implementation of their proposal. In this paper, we describe another constraint satisfaction method for the two tasks in the context of visual analogy: in our method, the source cases are organized in a discrimination tree, and all the sou...
متن کاملA Fractal Approach Towards Visual Analogy
We present a preliminary computational model of visual analogy that uses fractal image representations that rely only on the grayscale pixel values of input images, and are mathematical abstractions quite rigorously grounded in the theory of fractal image compression. We have applied this model of visual analogy to problems from the Raven’s Progressive Matrices intelligence test, and we describ...
متن کاملUsing Spatial Structure in the Associative Retrieval of 2-D Line Drawings
We consider the problem of associative image retrieval, focusing on retrieval of 2-D line drawings by example. We represent 2-D line drawings as semantic networks of spatial elements and relations among them. We describe a process for retrieving the drawings based on a structural analogy between the query and the stored images. We then present several methods of retrieving the drawings: the fir...
متن کاملMapping Constraint Satisfaction Problems to Algorithms and Heuristics
Constraint satisfaction has received great attention in recent years and a large number of algorithms have been developed. Unfortunately, from the problem solvers’ point of view, it is very difficult to see when and how to use these algorithms. This paper points out the need to map constraint satisfaction problems to constraint satisfaction algorithms and heuristics, and proposes that more rese...
متن کامل